General Purpose Parallel Computation on a Dna Substrate
نویسنده
چکیده
In this paper I describe and extend a new DNA computing paradigm introduced in Blumberg [4] for building massively parallel machines in the DNA-computing models described by Adelman [1, 2], Cai et. al.[5], and Liu et. al.[8]. Employing only DNA operations which have been reported as successfully performed, I present an implementation of a Connection Machine [7], a SIMD (single-instruction multiple-data) parallel computer as an illustration of how to apply this approach to building computers in this domain (and as an implicit demonstration of PRAM equivalence). This is followed with a description of how to implement a MIMD (multiple-instruction multiple-data) parallel machine. The implementations described herein di er most from existing models in that they employ explicit communication between processing elements (and hence strands of DNA).
منابع مشابه
A sticker based model for DNA computation
We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which information is represented and of separation by hybridization as a central mechanism. However, unlike previous models, the stickers model has a random access memory that requires no strand extension and uses no enzymes; als...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملGeneral Purpose Computation on Graphics Processing Units ( GPGPU ) using CUDA within the seminar Parallel Programming and Parallel Algorithms ( Winter Term 2009 / 2010 )
متن کامل
Parallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملA General Purpose Shared-memory Model for Parallel Computation
We describe a general-purpose shared-memory model for parallel computation, called the qsm 22], which provides a high-level shared-memory abstraction for parallel algorithm design, as well as the ability to be emulated in an eeective manner on the bsp, a lower-level, distributed-memory model. We present new emulation results that show that very little generality is lost by not having a `gap par...
متن کامل